全文获取类型
收费全文 | 8661篇 |
免费 | 739篇 |
国内免费 | 699篇 |
专业分类
化学 | 1319篇 |
晶体学 | 9篇 |
力学 | 156篇 |
综合类 | 224篇 |
数学 | 7687篇 |
物理学 | 704篇 |
出版年
2024年 | 11篇 |
2023年 | 142篇 |
2022年 | 204篇 |
2021年 | 223篇 |
2020年 | 298篇 |
2019年 | 345篇 |
2018年 | 345篇 |
2017年 | 330篇 |
2016年 | 268篇 |
2015年 | 175篇 |
2014年 | 378篇 |
2013年 | 812篇 |
2012年 | 359篇 |
2011年 | 515篇 |
2010年 | 467篇 |
2009年 | 655篇 |
2008年 | 603篇 |
2007年 | 520篇 |
2006年 | 522篇 |
2005年 | 417篇 |
2004年 | 368篇 |
2003年 | 334篇 |
2002年 | 300篇 |
2001年 | 243篇 |
2000年 | 202篇 |
1999年 | 181篇 |
1998年 | 179篇 |
1997年 | 109篇 |
1996年 | 106篇 |
1995年 | 89篇 |
1994年 | 71篇 |
1993年 | 50篇 |
1992年 | 43篇 |
1991年 | 28篇 |
1990年 | 20篇 |
1989年 | 31篇 |
1988年 | 25篇 |
1987年 | 19篇 |
1986年 | 7篇 |
1985年 | 31篇 |
1984年 | 19篇 |
1983年 | 5篇 |
1982年 | 13篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 3篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
3.
4.
5.
6.
Photocatalytic CO2 reduction to C1 fuels is considered to be an important way for alleviating increasingly serious energy crisis and environmental pollution. Due to the environment-friendly, simple preparation, easy formation of highly-stable metal-nitrogen(M-Nx) coordination bonds, and suitable band structure, polymeric carbon nitride-based single-atom catalysts(C3N4-based SACs) are expected to become a potential for CO2 reduction under visible-light irradiation. In this review, we summarize the recent advancement on C3N4-based SACs for photocatalytic CO2 reduction to C1 products, including the reaction mechanism for photocatalytic CO2 reduction to C1 products, the structure and synthesis methods of C3N4-based SACs and their applications toward photocatalytic CO2 reduction reaction(CO2RR) for C1 production. The current challenges and future opportunities of C3N4-based SACs for photoreduction of CO2 are also discussed. 相似文献
7.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
8.
9.
10.